Solving existence problems via $F$-contractions
نویسندگان
چکیده
منابع مشابه
Solving Frequency Assignment Problems via Tree-Decomposition
In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. We show that with the use of several dominance and bounding techniques it is possible to solve small and medium...
متن کاملSolving group technology problems via clique partitioning
This paper presents a new clique partitioning (CP) model for the Group Technology (GT) problem. The new model, based on a novel 0/1 quadratic programming formulation, addresses multiple objectives in GT problems by drawing on production relationships to assign differing weights to machine/ part pairs. The use of this model, which is readily solved by a basic tabu search heuristic, is illustrate...
متن کاملSolving constrained optimization problems via Subset Simulation
This paper extends the application of Subset Simulation (SS), an advanced Monte Carlo algorithm for reliability analysis, to solve constrained optimization problems encountered in engineering. The proposed algorithm is based on the idea that an extreme event (optimization problem) can be considered as a rare event (reliability problem). The Subset Simulation algorithm for optimization is a popu...
متن کاملSolving LP Problems via Weighted Centers
The feasibility problem for a system of linear inequalities can be converted into an unconstrained optimization problem by using ideas from the ellipsoid method, which can be viewed as a very simple minimization technique for the resulting nonlinear function. This function is related to the volume of an ellipsoid containing all feasible solutions, which is parametrized by certain weights which ...
متن کاملSolving network design problems via iterative aggregation
In this work, we present an exact approach for solving network design problems that is based on an iterative graph aggregation procedure. The scheme allows existing preinstalled capacities. Starting with an initial aggregation, we solve a sequence of network design master problems over increasingly fine-grained representations of the original network. In each step, a subproblem is solved that e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2017
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/13808